Quickest detection of a hidden target and extremal surfaces

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quickest Detection of a Hidden Target and Extremal Surfaces

where the surfaces f∗ and g∗ can be characterised as extremal solutions to a couple of first-order nonlinear PDEs expressed in terms of the infinitesimal characteristics of X and c . This is done by extending the arguments associated with the maximality principle [29] to the three-dimensional setting of the present problem and disclosing the general structure of the solution that is valid in al...

متن کامل

extremal region detection guided by maxima of gradient magnitude

a problem of computer vision applications is to detect regions of interest under dif- ferent imaging conditions. the state-of-the-art maximally stable extremal regions (mser) detects affine covariant regions by applying all possible thresholds on the input image, and through three main steps including: 1) making a component tree of extremal regions’ evolution (enumeration), 2) obtaining region ...

Quickest Change Detection in Hidden Markov Models for Sensor Networks

The decentralized quickest change detection problem is studied in sensor networks, where a set of sensors receive observations from a hidden Markov model (HMM) X and send sensor messages to a central processor, called the fusion center, which makes a final decision when observations are stopped. It is assumed that the parameter θ in the hidden Markov model for X changes from θ0 to θ1 at some un...

متن کامل

Quickest Moving Object Detection

We present a general framework and method for simultaneous detection and segmentation of an object in a video that moves (or comes into view of the camera) at some unknown time in the video. The method is an online approach based on motion segmentation, and it operates under dynamic backgrounds caused by a moving camera or moving nuisances. The goal of the method is to detect and segment the ob...

متن کامل

Decentralized quickest change detection

A decentralized formulation of the quickest change detection problem is studied, where the distributions of the observations at all of the sensors in the system change at the time of disruption, and the sensors communicate with a common fusion center. A Bayesian setting is considered in which a priori knowledge of the change time distribution is available. The observations are assumed to be ind...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Applied Probability

سال: 2014

ISSN: 1050-5164

DOI: 10.1214/13-aap979